Periodic Little’s Law
نویسندگان
چکیده
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
منابع مشابه
A Central-Limit-Theorem Version of the Periodic Little’s Law
Abstract We establish a central-limit-theorem (CLT) version of the periodic Little’s law (PLL), which complements the sample-path and stationary versions of the PLL which we recently established in order to explain the remarkable accuracy in comparisons of data-generated model simulations to direct estimates from the data for the aggregate occupancy level in a hospital emergency department. Our...
متن کاملLittle’s Law and High Performance Computing
This note discuses Little’s law and relates the form cited in queuing theory with a form often cited in the field of high performance computing. A rigorous mathematical proof of Little’s law is included. Author’s address: NAS Applications and Tools Group, NASA Ames Research Center, Moffett Field, CA 94035-1000; [email protected]
متن کاملOR FORUM - Little's Law as Viewed on Its 50th Anniversary
Fifty years ago, the author published a paper in Operations Research with the title, “A proof for the queuing formula: L = ãW ” [Little, J. D. C. 1961. A proof for the queuing formula: L = ãW . Oper. Res. 9(3) 383–387]. Over the years, L = ãW has become widely known as “Little’s Law.” Basically, it is a theorem in queuing theory. It has become well known because of its theoretical and practical...
متن کاملEstimating Waiting times with the Time-varying Little’s Law
When waiting times cannot be observed directly, Little’s law can be applied to estimate the average waiting time by the average number in system divided by the average arrival rate, but that simple indirect estimator tends to be biased significantly when the arrival rates are timevarying and the service times are relatively long. Here it is shown that the bias in that indirect estimator can be ...
متن کاملSampling at a Random Time with a Heavy-Tailed Distribution∗
Let Sn = ξ1 + · · · + ξn be a sum of i.i.d. non-negative random variables, S0 = 0. We study the asymptotic behaviour of the probability P{X(T ) > n}, n→∞, where X(t) = max{n ≥ 0 : Sn ≤ t}, t ≥ 0, is the corresponding renewal process. The stopping time T has a heavy-tailed distribution and is independent of X(t). We treat two different approaches to the study: via the law of large numbers and by...
متن کامل